I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries
نویسندگان
چکیده
We develop several linear or near-linear space and I/Oefficient dynamic data structures for orthogonal range-max queries and stabbing-max queries. Given a set of N weighted points in R, the rangemax problem asks for the maximum-weight point in a query hyperrectangle. In the dual stabbing-max problem, we are given N weighted hyper-rectangles, and we wish to find the maximum-weight rectangle containing a query point. Our structures improve on previous structures in several important ways.
منابع مشابه
Efficient external memory structures for range-aggregate queries
We present external memory data structures for efficiently answering range-aggregate queries. The range-aggregate problem is defined as follows: Given a set of weighted points in R, compute the aggregate of the weights of the points that lie inside a d-dimensional orthogonal query rectangle. The aggregates we consider in this paper include COUNT, SUM, and MAX. First, we develop a structure for ...
متن کاملA Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
In this paper we describe a dynamic data structure that answers one-dimensional stabbingmax queries in optimal O(log n/ log log n) time. Our data structure uses linear space and supports insertions and deletions in O(log n) and O(log n/ log log n) amortized time respectively. We also describe a O(n(log n/ log log n)d−1) space data structure that answers d-dimensional stabbing-max queries in O((...
متن کاملSearching in Dynamic Catalogs on a Tree
In this paper we consider the following modification of the iterative search problem. We are given a tree T , so that a dynamic catalog C(v) is associated with every tree node v. For any x and for any node-to-root path π in T , we must find the predecessor of x in ∪v∈πC(v). We present a linear space dynamic data structure that supports such queries in O(t(n) + |π|) time, where t(n) is the time ...
متن کاملSimultaneous Encodings for Range and Next/Previous Larger/Smaller Value Queries
Given an array of n elements from a total order, we propose encodings that support various range queries (range minimum, range maximum and their variants), and previous and next smaller/larger value queries. When query time is not of concern, we obtain a 4.088n+o(n)-bit encoding that supports all these queries. For the case when we need to support all these queries in constant time, we give an ...
متن کاملCell Probe Lower Bounds and Approximations for Range Mode
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] must return the mode of the subarray A[i], A[i+ 1], . . . , A[j]. We prove that any data structure that uses S memory cells of w bits needs Ω( log n log(Sw/n) ) time to answer a range mode query. Secondly, we consider th...
متن کامل